#include <iostream>
#include <vector>

using namespace std;

int max_sequence(vector<int> nums)
{
    int maxlen = 1;
    int len = 1;

    if (nums.size() <= 1) //对于这两种情况 直接返回数组大小即可
        return nums.size();

    int i = 1;
    while (i < nums.size())
    {
        (nums[i] > nums[i - 1]) ? len++ : len = 1;
        maxlen = maxlen > len ? maxlen : len;
        i++;
    }

    return maxlen;
}

#if 0
for (int i = 0; i < nums.size() - 1; i++)
{
    if (nums[i + 1] > nums[i])
        len++;
    else
        len = 1;

    maxlen = len > maxlen ? len : maxlen;
}
return maxlen;
#endif


int main()
{
    int len; //数组长度
    cin >> len;
    vector<int> vi;

    for (int i = 0; i < len; i++) //数组输入
    {
        int tmp;
        cin >> tmp;
        vi.push_back(tmp);
    }

    int maxlen = max_sequence(vi);
    cout << maxlen << endl;
    return 0;
}